منابع مشابه
Plural Quantifiers Inversely Linked
Inverse Linking constructions display an asymmetric requirement of “number concord” that can be summarized as follows: if the inversely linked quantifier is plural the host NP has to be plural as well. This paper argues that under suitable assumptions Beck’s proposal in [2] for definite plural DP-arguments of nouns can be extended to quantificational plural DPs in Inverse Linking constructions....
متن کاملPlural Quantifications and Generalized Quantifiers
This paper discusses two important results on the expressive limitations of elementary languages that David Kaplan established a few decades ago, and clarifies how they relate to the expressive power of plural constructions of natural languages. Kaplan proved that such plural quantifications as the following cannot be paraphrased into elementary languages: Most things are funny. (1) Some critic...
متن کاملComparative Quantifiers and Plural Predication
Somewhat surprisingly, there is little work addressing this question even though there are two distinguished traditions each concerned with a subset of the paradigm. On the one hand, Generalized Quantifier Theory (GQT) offers an analysis of expressions as in (1)a,b as run of the mill quantifiers, while the theory of comparative constructions, analyzes expressions as in (1)d,e as amount comparat...
متن کاملLabelled Modal Logics: Quantifiers
In previous work we gave an approach, based on labelled natural deduction, for formalizing proof systems for a large class of propo-sitional modal logics that includes K, D, T, B, S4, S4:2, KD45, and S5. Here we extend this approach to quantiied modal logics, providing for-malizations for logics with varying, increasing, decreasing, or constant domains. The result is modular with respect to bot...
متن کاملBisimulation Quantifiers for Modal Logics
Modal logics have found applications in many different contexts. For example, epistemic modal logics can be used to reason about security protocols, temporal modal logics can be used to reason about the correctness of distributed systems and propositional dynamic logic can reason about the correctness of programs. However, pure modal logic is expressively weak and cannot represent many interest...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Synthese
سال: 2013
ISSN: 0039-7857,1573-0964
DOI: 10.1007/s11229-013-0354-5